منابع مشابه
On the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملOn a quadratic matrix equation associated with an M-matrix∗
We study the quadratic matrix equation X2 − EX − F = 0, where E is diagonal and F is an M -matrix. Quadratic matrix equations of this type arise in noisy Wiener–Hopf problems for Markov chains. The solution of practical interest is a particular M -matrix solution. The existence and uniqueness of M -matrix solutions and numerical methods for finding the desired M -matrix solution are discussed b...
متن کاملon the modified iterative methods for $m$-matrix linear systems
this paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the accelerated overrelaxation (aor) method. in this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملSOLVING FUZZY LINEAR SYSTEMS BY USING THE SCHUR COMPLEMENT WHEN COEFFICIENT MATRIX IS AN M-MATRIX
This paper analyzes a linear system of equations when the righthandside is a fuzzy vector and the coefficient matrix is a crisp M-matrix. Thefuzzy linear system (FLS) is converted to the equivalent crisp system withcoefficient matrix of dimension 2n × 2n. However, solving this crisp system isdifficult for large n because of dimensionality problems . It is shown that thisdifficulty may be avoide...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90166-2